Heyting-Brouwer Rough Set Logic
نویسندگان
چکیده
A rough set logic based on Heyting-Brouwer algebras HBRSL is proposed as a basis for reasoning about rough information. It is an extension of Düntsch’s logic with intuitionistic implication, and is seen as a variant of HeytingBrouwer logic. A Kripke semantics and natural deduction for the logic are presented and the completeness theorem is proved.
منابع مشابه
Study of Behaviours via Visitable Paths
Ludics is a logical theory that J.-Y. Girard developed around 2000. At first glance, it may be considered as a Brouwer-Heyting-Kolmogorov interpretation of Logic as a formula is denoted by the set of its proofs. More primitively, Ludics is a theory of interaction that models (a variant of) second-order multiplicative-additive Linear Logic. A formula is denoted by a set of objects called a behav...
متن کاملProofs, Disproofs, and Their Duals
Bi-intuitionistic logic, also known as Heyting-Brouwer logic or subtractive logic, is extended in various ways by a strong negation connective used to express commitments arising from denials. These logics have been introduced and investigated in [48]. In the present paper, an inferentialist semantics in terms of proofs, disproofs, and their duals is developed. Whereas the Brouwer-Heyting-Kolmo...
متن کاملSemantics of intuitionistic propositional logic
Intuitionistic logic is a weakening of classical logic by omitting, most prominently, the principle of excluded middle and the reductio ad absurdum rule. As a consequence, this logic has a wider range of semantical interpretations. The motivating semantics is the so called Brouwer-Heyting-Kolmogorov interpretation of logic. The propositions A,B,C, . . . are regarded as problems or tasks to be s...
متن کاملOn Logics with Coimplication
This paper investigates (modal) extensions of Heyting-Brouwer logic, i.e., the logic which results when the dual of implication (alias coimplication) is added to the language of intuitionistic logic. We rst develop matrix as well as Kripke style semantics for those logics. Then, by extending the Godel-embedding of intuitionistic logic into S4, it is shown that all (modal) extensions of Heyting...
متن کاملFrom constructivism to computer science 1
Preamble My ÿeld is mathematical logic, with a special interest in constructivism, and I would not dare to call myself a computer scientist. But some computer scientists regard my work as a contribution to their ÿeld; and in this text I shall try to explain how this is possible, by taking a look at the history of ideas. I want to describe how two interrelated ideas, connected with the construct...
متن کامل